Region merging with topological control

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Region merging with topological control

This paper presents a region merging process controlled by topological features on regions in 3D images. Betti numbers, a well-known topological invariant, are used as criteria. Classical and incremental algorithms to compute Betti numbers using information represented by the topological map of an image are provided. The region merging algorithm, which merges of any number of connected componen...

متن کامل

Topological Map Merging

When multiple robots cooperatively explore an environment, maps from individual robots must be merged to produce a single globally consistent map. This is a difficult problem when the robots do not have a common reference frame or global positioning. In this paper, we describe an algorithm for merging embedded topological maps. Topological maps provide a concise description of the navigability ...

متن کامل

Segmentation Using Region Merging with Edges

Segmentation is the division of an image into a number of contained self-consistent regions. Each region must be homogeneous with respect to a particular property such as intensity, colour or texture. Ideally the regions will clearly relate to distinct elements or objects within the scene. In general segmentation can be achieved by one of two approaches — either using a region based method whic...

متن کامل

Comparison of Local and Global Region Merging in the Topological Map

The topological map is a model that represents 2D and 3D images subdivision. It aims to allow the use of topological and geometrical features of the subdivision in image processing operations. When handling regions in an image, one of the main operation is the region merging, for example in segmentation process. This paper presents two algorithms of region merging in 3D topological maps: one lo...

متن کامل

Region Merging Via Graph-Cuts

In this paper, we discuss the use of graph-cuts to merge the regions of the watershed transform optimally. Watershed is a simple, intuitive and efficient way of segmenting an image. Unfortunately it presents a few limitations such as over-segmentation and poor detection of low boundaries. Our segmentation process merges regions of the watershed over-segmentation by minimizing a specific criteri...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Discrete Applied Mathematics

سال: 2009

ISSN: 0166-218X

DOI: 10.1016/j.dam.2009.04.005